Detecting automorphic orbits in free groups
نویسنده
چکیده
We present an effective algorithm for detecting automorphic orbits in free groups, as well as a number of algorithmic improvements of train tracks for free group automorphisms.
منابع مشابه
Recognition of Whitehead-Minimal Elements in Free Groups of Large Ranks
In this paper we introduce a pattern classification system to recognize words of minimal length in their automorphic orbits in free groups. This system is based on Support Vector Machines and does not use any particular results from group theory. The main advantage of the system is its stable performance in recognizing minimal elements in free groups with large ranks.
متن کاملAutomorphic orbits in Free Groups: Words versus Subgroups
We show that the following problems are decidable in rank 2 free groups: does a given finitely generated subgroup H contain primitive elements? and does H meet the automorphic orbit of a given word u? In higher rank, we show the decidability of the following weaker problem: given a finitely generated subgroup H , a word u and an integer k, does H contain the image of u by some k-almost bounded ...
متن کاملAutomorphic orbits in free groups
Let Fn be the free group of a finite rank n. We study orbits Orbφ(u), where u is an element of the group Fn, under the action of an automorphism φ. If an orbit like that is finite, we determine precisely what its cardinality can be if u runs through the whole group Fn, and φ runs through the whole group Aut(Fn). Another problem that we address here is related to Whitehead’s algorithm that deter...
متن کاملPattern recognition and minimal words in free groups of rank 2
We describe a linear time probabilistic algorithm to recognize Whitehead minimal elements (elements of minimal length in their automorphic orbits) in free groups of rank 2. For a non-minimal element the algorithm gives an automorphism that is most likely to reduce the length of the element. This method is based on linear regression and pattern recognition techniques.
متن کاملContemporary Mathematics Whitehead Method and Genetic Algorithms
In this paper we discuss a genetic version (GWA) of Whitehead Algorithm, which is one of the basic algorithms in combinatorial group theory. It turns out that GWA is surprisingly fast and outperforms the standard Whitehead algorithm in free groups of rank > 5. Experimenting with GWA we collected an interesting numerical data that clarifies the time-complexity of Whitehead’s Problem in general. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008